Kernel Negative ε Dragging Linear Regression for Pattern Classification
نویسندگان
چکیده
منابع مشابه
Kernel Linear Collaborative Discriminant Regression Classification for Face Recognition Using Local Binary Pattern
Binary feature descriptors have been widely used in computer vision field due to their excellent discriminative power and strong robustness, and local binary patterns (LBP) and its variations have proven that they are effective face descriptors. However, the forms of such binary feature descriptors are predefined in the hand-crafted way, which requires strong domain knowledge to design them. In...
متن کاملKernel regression for fMRI pattern prediction
This paper introduces two kernel-based regression schemes to decode or predict brain states from functional brain scans as part of the Pittsburgh Brain Activity Interpretation Competition (PBAIC) 2007, in which our team was awarded first place. Our procedure involved image realignment, spatial smoothing, detrending of low-frequency drifts, and application of multivariate linear and non-linear k...
متن کاملLearning the Kernel for Classification and Regression
We investigate a series of learning kernel problems with polynomial combinations of base kernels, which will help us solve regression and classification problems. We also perform some numerical experiments of polynomial kernels with regression and classification tasks on different datasets.
متن کاملOptimal Kernel Shapes for Local Linear Regression
Local linear regression performs very well in many low-dimensional forecasting problems. In high-dimensional spaces, its performance typically decays due to the well-known "curse-of-dimensionality". A possible way to approach this problem is by varying the "shape" of the weighting kernel. In this work we suggest a new, data-driven method to estimating the optimal kernel shape. Experiments using...
متن کاملGeneralized Kernel Classification and Regression
We discuss kernel-based classification and regression in a general context, emphasizing the role of convex duality in the problem formulation. We give conditions for the existence of the dual problem, and derive general globally convergent classification and regression algorithms for solving the true (i.e. hard-margin or rigorous) dual problem without resorting to approximations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2017
ISSN: 1076-2787,1099-0526
DOI: 10.1155/2017/2691474